332. Reconstruct Itinerary - LeetCode Solution


Depth-first Search Graph

Python Code:

class Solution:
    def findItinerary(self, tickets: List[List[str]]) -> List[str]:
        def d(c):
            while(len(g[c]) > 0):
                d(g[c].pop(0))
            r.insert(0, c) 
            
        g = collections.defaultdict(list)
        for u, v in (tickets):
            
            g[u].append(v)
            
            g[u].sort()
            
        r=[]      
        
        d("JFK")
        
        return r
        


Comments

Submit
0 Comments
More Questions

236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD